import java.io.*;
import java.util.Arrays;
import java.util.Scanner;

/*
 ID: ning yusui
 LANG: JAVA
 TASK: nocows
 */

public class nocows {
    public static final int MODULO = 9901;
    Scanner in;
    PrintWriter out;


    static final int N = 200 + 1;
    static final int C = 100 + 1;

    private int[][] equalData = new int[N][C];
    private int[][] lessData = new int[N][C];

    public nocows() throws IOException {
        in = new Scanner(new File(this.getClass().getName() + ".in"));
        out = new PrintWriter(new BufferedWriter(new FileWriter(this.getClass().getName() +
                ".out")));
    }

    private void work() {
        int n = in.nextInt();
        int k = in.nextInt();
        for (int[] data : equalData) {
            Arrays.fill(data, -1);
        }
        for (int[] data : lessData) {
            Arrays.fill(data, -1);
        }
        for (int i = 2; i < C; i++) {
            equalData[1][i] = 0;
            lessData[1][i] = 1;
        }
        for (int i = 2; i < N; i++) {
            equalData[i][1] = 0;
            lessData[i][1] = 0;
        }
        lessData[0][1] = 1;
        equalData[1][1] = 1;
        int ret = equalNumber(n, k);
        out.println(ret);
        out.flush();
        out.close();
    }


    private int equalNumber(int n, int k) {
        int ret = 0;
        if (k < 0) {
            ret = 0;
        } else if (equalData[n][k] > -1) {
            ret = equalData[n][k];
        } else {
for (int left = 1; left < n - 1; left++) {
    int right = n - 1 - left;
    ret = (ret + equalNumber(left, k - 1) * (lessNumber(right, k - 1) + equalNumber(right, k - 1))
            + lessNumber(left, k - 1) * equalNumber(right, k - 1)
    ) % MODULO;
}
//            System.out.println("equalNumber:" + n + "," + k + "=" + ret);
        }
        return equalData[n][k] = ret;
    }

    private int mutli2k1(int k) {
        return (2 * k - 1);
    }

    private int lessNumber(int n, int k) {
        int ret = 0;
        if (k < 0) {
            ret = 0;
        } else if (lessData[n][k] > -1) {
            ret = lessData[n][k];
        } else {
            for (int left = 1; left < n - 1; left++) {
                ret = (ret + lessNumber(left, k - 1) * lessNumber(n - 1 - left, k - 1)) % MODULO;
            }
//            System.out.println("lessNumber:" + n + "," + k + "=" + ret);
        }
        return lessData[n][k] = ret;
    }

    private int pow2k1(int k) {
        return (1 << k) - 1;
    }

    public static void main(String[] args) throws IOException {
        new nocows().work();
    }

}
